Analysis of Fault Tolerance in Cayley Digraphs Using Forbidden Faulty Sets Parallel and Distributed Computing Laboratory Analysis of Fault Tolerance in Cayley Digraphs Using Forbidden Faulty Sets

PDCL PDCL PDCL PDCL PDCL PDCL PDCL PDCL PDCL PDCL PDCL PDCL PDCL PDCL PDCL PDCL PDCL PDCL PDCL PDCL Abstract The connectivity and fault tolerance measures of various interconnection networks assume that all the neighboring nodes of any node could be faulty at the same time. The forbidden faulty set analysis of restricted connectivity and fault tolerance assumes that a set of nodes cannot be faulty at the same time. We discuss the diiculties in analyzing the fault-tolerance of directed Cayley graphs using forbidden faulty sets. A new forbidden set is deened with pairs of nodes as elements to study the fault tolerance of the Cayley digraphs. The fault tolerance under this forbidden faulty set is shown to be (2n?5). We also present an algorithm for determining the connectivity of Cayley digraphs under (2n ? 4) faults and evaluate its time complexity.